Point fixe d’une application non contractante
نویسندگان
چکیده
منابع مشابه
Expérimentation de stratégies itératives chaotiques sur des problèmes de point fixe à grand nombre de variables
متن کامل
Construction d’un point fixe commun à une famille de contractions fermes
Abridged English Version – Let (Ti)i∈I be a countable family of firmly nonexpansive mappings on a real Hilbert space H [i.e., (1) holds] and let F denote their set of common fixed points, which is assumed to be nonempty. In this Note we consider the problem (P) of finding a point in F . This generic problem arises in many branches of applied mathematics, e.g., solving systems of variational ine...
متن کاملExtending DUNE: The dune-xt modules
We present our effort to extend and complement the core modules of the Distributed and Unified Numerics Environment DUNE (http://dune-project.org) by a well tested and structured collection of utilities and concepts. We describe key elements of our four modules dune-xt-common, dune-xt-grid, dune-xt-la and dune-xt-functions, which aim at further enabling the programming of generic algorithms wit...
متن کاملDynamic agricultural non-point source assessment tool (DANSAT): Model application
* Corresponding author. E-mail addresses: [email protected] (J. Cho), sm 1537-5110/$ – see front matter Published by doi:10.1016/j.biosystemseng.2009.01.012 The dynamic agricultural non-point source assessment tool (DANSAT) is a distributedparameter, physically based, and continuous-simulation model for simulating spatial and temporal impacts of best management practices (BMPs) on hydrology and water...
متن کاملAlgorithmes temporels rapides de type point fixe pour la séparation aveugle de mélanges convolutifs Time-domain fast fixed-point algorithms for blind separation of convolutive mixtures
This paper presents new blind separation methods for Moving Average (MA) convolutive mixtures of independent MA processes. They consist of time-domain extensions of the FastICA algorithms developed by Hyvärinen and Oja for instantaneous mixtures. They perform a convolutive sphering in order to use parameter-free fast fixed-point algorithms associated with kurtotic or negentropic nongaussianity ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista Matemática Iberoamericana
سال: 2006
ISSN: 0213-2230
DOI: 10.4171/rmi/459